On Finding the Height of a Binary Search Tree
نویسندگان
چکیده
منابع مشابه
Profile and Height of Random Binary Search Trees
The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.
متن کاملThe height of a binary search tree: the limiting distribution perspective
Wojciech Szpankowskit Department of Computer Science Purdue University W. Lafayette, IN 47907 U.s.A. spa~cs.purdue. cdu We study the height of the binary search tree the most fundamental data structure used for searching. We assume that the binary search tree is built from a random permutation of n elements. Under this assumption, we study the limiting distribution of the height as n -4 00. We ...
متن کاملConnecting Yule Process, Bisection and Binary Search Tree via Martingales
We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.
متن کاملThe Height of Binary Search Trees
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion de documents scientifiques de niveau r...
متن کاملThe Height of q-Binary Search Trees
The paper [8] introduces for the first time a meaningful q–model of binary search trees: instead of binary search trees, one considers tournament trees, which differ only marginally from binary search trees; if one starts from a permutation ( 1 2 ··· n π1 π2 ··· πn ) , then one inserts the number i instead of the number πi. Thus, traversing the tree in inorder, we might think of the associated ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1993
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/36.3.280